Planning and Obstacle Avoidance for Mobile Robots

نویسندگان

  • Evangelos Papadopoulos
  • Ioannis Poulakakis
چکیده

A planning methodology for nonholonomic mobile manipulators that employs smooth and continuous functions such as polynomials is developed. The method decouples kinematically the manipulator from the platform by constructing admissible paths that drive it to a final configuration and is based on mapping the nonholonomic constraint to a space where it can be trivially satisfied. In addition, the method allows for direct control over the platform orientation. The developed transformation also maps Cartesian space obstacles to transformed ones and allows for obstacle avoidance by increasing the order of the polynomials that are used in planning trajectories. The additional parameters required are computed systematically. It is shown how the method can be extended for avoiding obstacles of any number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Motion Planning and Obstacle Avoidance for Mobile Robots in Highly Cluttered Dynamic Environments

After a quarter century of mobile robot research, applications of this fascinating technology appear in real-world settings. Some require operation in environments that are densely cluttered with moving obstacles. Public mass exhibitions or conventions are examples of such challenging environments. This dissertation addresses the navigational challenges that arise in settings where mobile robot...

متن کامل

Path Planning and Obstacle Avoidance for Autonomous Mobile Robots: A Review

Recent advances in the area of mobile robotics caused growing attention of the armed forces, where the necessity for unmanned vehicles being able to carry out the “dull and dirty” operations, thus avoid endangering the life of the military personnel. UAV offers a great advantage in supplying reconnaissance data to the military personnel on the ground, thus lessening the life risk of the troops....

متن کامل

Motion Path Planning for Mobile Robots

Potential field methods are rapidly gaining popularity in obstacle avoidance applications for mobile robots. The general principles of potential field path planning are presented first. The electrostatic potential field (EPF) path planner is then combined with a twolayered fuzzy logic inference engine and implemented for mobile robot navigation in a 2-D dynamic environment. The first layer of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001